Issues in Multiprocessor Memory Consistency Protocol Design and Verification
نویسندگان
چکیده
Distributed shared memory (DSM) systems are central to our advancement in terms of high-performance computing. The complexity of DSM protocol design stems both from the complexity of the high-level notion of correctness— conformance to a modern weak shared memory model—and the degree to which these protocols are aggressive. Many similar issues are faced in the design of related protocols such as in input/output subsystems. In this paper we provide a glimpse of the complexity faced, and our work in progress in addressing these issues through model-checking and synthesis using recently proposed challenge problems to drive our research.
منابع مشابه
Formal Verification of Delayed Consistency Protocols
In a cache-coherent, shared-memory multiprocessor system, data consistency among cached copies can be delayed until synchronization points under relaxed memory consistency models. Some protocols called delayed consistency protocols take advantage of this flexibility to reduce cache miss rates and memory traffic. However, they are very complex and validating their correctness, even at the behavi...
متن کاملDesign Verification of the S3.mp Cache-Coherent Shared-Memory System
This paper describes the methods used to formulate and validate the memory subsystem of the cache-coherent Sun Scalable Shared-memory MultiProcessor (S3.mp) at three levels of abstraction: the memory consistency model, the cache coherence protocol, and the implementation.
متن کاملModular Deductive Verification of Multiprocessor Hardware Designs
We present a new framework for modular verification of hardware designs in the style of the Bluespec language. That is, we formalize the idea of components in a hardware design, with well-defined input and output channels; and we show how to specify and verify components individually, with machinechecked proofs in the Coq proof assistant. As a demonstration, we verify a fairly realistic impleme...
متن کاملProving sequential consistency by model checking
Sequential consistency is a multiprocessor memory model of both practical and theoretical importance. Unfortunately, the general problem of verifying that a finitestate protocol implements sequential consistency is undecidable, and in practice, validating that a real-world, finitestate protocol implements sequential consistency is very time-consuming and costly. In this work, we show that for m...
متن کاملDimensions of Verifying the Hardware-Software Interface in a Shared-Memory Multiprocessor
Scalable shared-memory multiprocessors provide a flexible programming model with good performance scaling. These features, however, come at the expense of additional hardware complexity to provide a consistent view of the memory hierarchy. Verifying this aspect of a multiprocessor system is nontrivial, often requiring far more time than the actual implementation. We investigate the various appr...
متن کامل